Add Longest Consecutive Difference Path problem with solution #6723
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Problem: Given an integer array, find the length of the longest path where the absolute difference between consecutive elements is 1. The path does not need to be contiguous.
Category: Dynamic Programming with Hashing
File Added:
src/main/java/com/thealgorithms/dynamicprogramming/LongestConsecutiveDiffPath.java
Features:
Uses a HashMap to track longest paths.
Includes sample test cases in the main method.
Time Complexity: O(n), Space Complexity: O(n)
This problem is unique and not available on LeetCode, making it a valuable addition to the repository.